Write Once, Deploy N
نویسنده
چکیده
To focus the comparison of languages for model checking and transformation on criteria that matter in practical development, there is an urgent need for more, and more realistic, case studies. In this position paper, we first present the problem of developing distributed database applications that are optimized for concurrent data access. The problem constraints are avoiding vendor lock-in, making a proper separation of concerns, and enabling tool support for domain evolution. Then, we derive the requirements and tradeoffs for designing a language for model refinement and code generation based on the presented problem. After applying a conceptual transformation language to our case study, we derive general conclusions on composition, sequencing, inheritance, and design by contract for such languages.
منابع مشابه
The “Write Once, Deploy N” MDA Case Study Combining Performance Tuning with Vendor Independence
Optimizing the performance of distributed database applications is hard to combine with middleware vendor independence since cache, transaction and cluster configuration is database and application server specific. We propose to generate product specific optimized code from a vendor independent specification. In this paper, we illustrate this approach for a specific middleware performance patte...
متن کاملHow to Reuse a "Write-Once" Memory
Storage media such as digital optical disks, PROMS, or paper tape consist of a number of "write-once" bit positions (wits); each wit initially contains a "0" that may later be irreversibly overwritten with a "1." It is demonstrated that such "write-once memories" (woms) can be "rewritten" to a surprising degree. For example, only 3 wits suffice to represent any 2-bit value in a way that can lat...
متن کاملNotes for Lecture 3 Revised 10 / 6 / 04 1 Space - Bounded Complexity Classes
A machine solves a problem using space s(·) if, for every input x, the machine outputs the correct answer and uses only the first s(|x|) cells of the tape. For a standard Turing machine, we can’t do better than linear space since x itself must be on the tape. So we will often consider a machine with multiple tapes: a read-only “input” tape, a read/write “work” or “memory” tape, and possibly a w...
متن کاملNotes on Space - Bounded Complexity
A machine solves a problem using space s(·) if, for every input x, the machine outputs the correct answer and uses only the first s(|x|) cells of the tape. For a standard Turing machine, we can’t do better than linear space since x itself must be on the tape. So we will often consider a machine with multiple tapes: a read-only “input” tape, a read/write “work” or “memory” tape, and possibly a w...
متن کاملNotes for Lecture 7 1 Space - Bounded Complexity Classes
A machine solves a problem using space s(·) if, for every input x, the machine outputs the correct answer and uses only the first s(|x|) cells of the tape. For a standard Turing machine, we can’t do better than linear space since x itself must be on the tape. So we will often consider a machine with multiple tapes: a read-only “input” tape, a read/write “work” or “memory” tape, and possibly a w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004